def add_two_numbers(a, b):
    return a + b


print(add_two_numbers(10, 22))


# Prime number checker 检查质数
def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
    return True


print(is_prime(23))

# 函数返回多个值
def move(x, y, step):
    new_x = x + step
    new_y = y + step
    return new_x, new_y


result = move(100, 100, 60)
print(result)

# 递归实现阶乘
def factorial(n):
    if n == 1:
        return 1
    else:
        return n * factorial(n - 1)

print(factorial(5))
